Alberto Mozó: BIP Computers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Problem 19 Alberto

A closed λ-termM is easy if, for any other closed termN , the lambda theory generated by M = N is consistent, while it is simple easy if, given an arbitrary intersection type τ , one can find a suitable pre-order on types which allows to derive τ forM . Simple easiness implies easiness. The question whether easiness implies simple easiness constitutes Problem 19 in the TLCA list of open problem...

متن کامل

Alberto Corso A

Given a local Noetherian ring (R, m) of dimension d > 0 and infinite residue field, we study the invariants (dimension and multiplicity) of the Sally module SJ (I) of any m-primary ideal I with respect to a minimal reduction J. As a by-product we obtain an estimate for the Hilbert coefficients of m that generalizes a bound established by J. Elias and G. Valla in a local Cohen-Macaulay setting. ...

متن کامل

Alberto A . Martinez : Negative Math

is published by Princeton University Press and copyrighted, © 2005, by Princeton University Press. All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher, except for reading and browsing via the World Wide Web. Users ar...

متن کامل

Guido Gherardi and Alberto Marcone

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

متن کامل

Relating BIP and Reo

Coordination languages simplify design and development of concurrent systems. Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly. In this paper we establish a formal relation between BI(P) (i.e., BIP without the priority layer) and Reo, by defining transformations between their semantic mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ARQ (Santiago)

سال: 2009

ISSN: 0717-6996

DOI: 10.4067/s0717-69962009000100002